Optimistic Heuristics for MineSweeper
نویسندگان
چکیده
We present a combination of Upper Confidence Tree (UCT) and domain specific solvers, aimed at improving the behavior of UCT for long term aspects of a problem. Results improve the state of the art, combining top performance on small boards (where UCT is the state of the art) and on big boards (where variants of CSP rule).
منابع مشابه
Algorithmic Approaches to Playing Minesweeper
This thesis explores the challenges associated with designing a Minesweeper solving algorithm. In particular, it considers how to best start a game, various heuristics for handling guesses, and different strategies for making deterministic deductions. The paper explores the single point approach and the constraint satisfaction problem model for playing Minesweeper. I present two novel implement...
متن کاملMinesweeper on graphs
Minesweeper is a popular single player game. It has been shown that the Minesweeper consistency problem is NPcomplete and the Minesweeper counting problem is #P-complete. We present a polynomial algorithm for solving these problems for minesweeper graphs with bounded treewidth.
متن کاملPlaying the Minesweeper with Constraints
We present the design and implementation of a Minesweeper game, augmented with a digital assistant. The assistant uses contraint programming techniques to help the player, and is able to play the game by itself. It predicts safe moves, and gives probabilistic information when safe moves cannot be found.
متن کاملMinesweeper, #minesweeper
We address the problem of finding an optimal policy for an agent playing the game of minesweeper. The problem is solved exactly, within the reinforcement learning framework, using a modified value iteration. Although it is a Partially Observable Markov Decision Problem (MDP), we show that, when using an appropriate state space, it can be defined and solved as a fully observable MDP. As has been...
متن کاملPessimistic Heuristics Beat Optimistic Ones in Real-Time Search
Admissibility is a desired property of heuristic evaluation functions, because when these heuristics are used with complete search methods, such as A* and RBFS, they guarantee that an optimal solution will be found. Since every optimistic heuristic function is admissible, optimistic functions are widely used. We show, however, that with incomplete, real-time search, optimistic functions lose th...
متن کامل